Approximate common divisor problem and lattice sieving
نویسندگان
چکیده
منابع مشابه
Algorithms for the Approximate Common Divisor Problem
The security of several homomorphic encryption schemes depends on the hardness of variants of the approximate common divisor (ACD) problem. We survey and compare a number of latticebased algorithms for the ACD problem, with particular attention to some very recently proposed variants of the ACD problem. One of our main goals is to compare the multivariate polynomial approach with other methods....
متن کاملApproximate Polynomial Common Divisor Problem Relates to Noisy Multipolynomial Reconstruction
In this paper, we investigate the hardness of the approximate polynomial common divisor problem, which is regarded as a polynomial analogy of the approximate integer common divisor problem. In order to solve this problem, we present a simple method by using the polynomial lattice reduction algorithm and contain complete theoretical analyses. Further, we propose an improved lattice attack to red...
متن کاملMean Squared Length of Vectors in the Approximate Greatest Common Divisor Lattice
This paper derives the mean squared length of vectors in a lattice relevant to the Approximate GCD problem and the related fully homomorphic encryption scheme.
متن کاملVariable projection methods for approximate (greatest) common divisor computations
We consider the problem of finding for a given N -tuple of polynomials (real or complex) the closest N -tuple that has a common divisor of degree at least d. Extended weighted Euclidean seminorm of the coefficients is used as a measure of closeness. Two equivalent representations of the problem are considered: (i) direct parameterization over the common divisors and quotients (image representat...
متن کاملNearest common root of polynomials, approximate greatest common divisor and the structured singular value
Copyright & reuse City University London has developed City Research Online so that its users may access the research outputs of City University London's staff. Copyright © and Moral Rights for this paper are retained by the individual author(s) and/ or other copyright holders. All material in City Research Online is checked for eligibility for copyright before being made available in the live ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Математические вопросы криптографии
سال: 2018
ISSN: 2220-2617,2222-3193
DOI: 10.4213/mvk257